Shape matching under rigid motion
نویسندگان
چکیده
منابع مشابه
Shape matching under rigid motion
We present improved algorithms to match two polygonal shapes P and Q to approximate their maximum overlap. Let n be their total number of vertices. Our first algorithm finds a translation that approximately maximizes the overlap area of P and Q under translation in Õ(n2ε−3) time. The error is additive and it is at most ε · min{area(P ), area(Q)} with probability 1 − n−O(1). We also obtain an al...
متن کاملRigid and Non-rigid Shape Matching for Mechanical Components Retrieval
Reducing the setup time for a new production line is critical to the success of a manufacturer within the current competitive and cost-conscious market. To this end, being able to reuse already available machines, toolings and parts is paramount. However, matching a large warehouse of previously engineered parts to a new component to produce, is often more a matter of art and personal expertise...
متن کاملSeparating Rigid Motion for continuous Shape Evolution
A method is proposed for the construction of descent directions for the minimization of energy functionals defined for plane curves. The method is potentially useful in a number of image analysis problems, such as image registration and shape warping, where the standard gradient descent curve evolutions are not always feasible. The descent direction is constructed by taking a weighted average o...
متن کاملApproximate Geometric Pattern Matching Under Rigid Motions
We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal, and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.
متن کاملOverlap of Convex Polytopes under Rigid Motion
We present an algorithm to compute an approximate overlap of two convex polytopes P1 and P2 in R3 under rigid motion. Given any ε ∈ (0, 1/2], our algorithm runs in O(ε−3n log3.5 n) time with probability 1− n−O(1) and returns a (1− ε)-approximate maximum overlap, provided that the maximum overlap is at least λ ·max{|P1|, |P2|} for some given constant λ ∈ (0, 1]. 1998 ACM Subject Classification F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.01.002